The composite iteration algorithm for finding efficient and financially fair risk-sharing rules
نویسندگان
چکیده
منابع مشابه
Finding Fair and Efficient Allocations
We study the problem of allocating indivisible goods fairly and efficiently among a set of agents who have additive valuations for the goods. Here, an allocation is said to be fair if it is envy-free up to one good (EF1), which means that each agent prefers its own bundle over the bundle of any other agent, up to the removal of one good. In addition, an allocation is deemed to be efficient if i...
متن کاملRepresentative consumer's risk aversion and efficient risk-sharing rules
We study the representative consumer’s risk attitude and efficient risk-sharing rules in a singleperiod, single-good economy in which consumers have homogeneous probabilistic beliefs but heterogeneous risk attitudes. We prove that if all consumers have convex absolute risk tolerance, so must the representative consumer. We also identify a relationship between the curvature of an individual cons...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولEfficient and Fair Resource Sharing Algorithm for Multi-user MIMO-OFDM Systems
In this paper, an efficient and fair algorithm for resource management in MIMO-OFDM systems is proposed. The system used for this analysis is the downlink of multi-user MIMO-OFDM system. Based on channel state information (CSI), the base station (BS) employs singular value decomposition (SVD) to transmit the MIMO channel into parallel subchannels for each subcarrier, and then subcarriers, are a...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2017
ISSN: 0304-4068
DOI: 10.1016/j.jmateco.2017.07.008